Fast computation of class fields given their norm group
نویسندگان
چکیده
منابع مشابه
Fast computation of class fields given their norm group
Let K be a number field containing, for some prime `, the `-th roots of unity. Let L be a Kummer extension of degree ` of K characterized by its modulus m and its norm group. Let Km be the compositum of degree ` extensions of K of conductor dividing m. Using the vector-space structure of Gal(Km/K), we suggest a modification of the rnfkummer function of PARI/GP which brings the complexity of the...
متن کاملFast Computation of Relative Class Numbers of CM-Fields
It was well known that it is easy to compute relative class numbers of abelian CM-fields by using generalized Bernoulli numbers (see Theorem 4.17 in Introduction to cyclotomic fields by L. C. Washington, Grad. Texts in Math., vol. 83, Springer-Verlag, 1982). Here, we provide a technique for computing the relative class number of any CM-field. 1. Statement of the results Proposition 1. Let n ≥ 1...
متن کاملDistributed class group computation
We present an improved sequential and a parallel version of the algorithm of Hafner and McCurley for the computation of the class group of imaginary quadratic elds. We describe the implementation of this algorithm on a network of UNIX-workstations using the system LIPS.
متن کاملOn the Computation of Hilbert Class Fields
Let k be an algebraic number eld. We describe a procedure for computing the Hilbert class eld ?(k) of k, i.e. the maximal abelian extension unramiied at all places. In the rst part of the paper we outline the underlying theory and in the second part we present the important algorithms and give several examples.
متن کاملFast Computation of a Class of Running
The paper focuses on the computation of a class of running lters deened as the n-ary extension of an associative, commutative and idempotent binary operation T on an ordered sequence of operands. The well-known max/min lters are the prominent representatives of the class. For any arbitrary window lter of size n, the existence of a fast algorithm of complexity O(log 2 n) T-operations is proven. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2008
ISSN: 1246-7405
DOI: 10.5802/jtnb.646